Generalized Linkage Construction for Constant-Dimension Codes
نویسندگان
چکیده
A constant-dimension code (CDC) is a set of subspaces constant dimension in common vector space with upper bounded pairwise intersection. We improve and generalize two constructions for CDCs, the improved linkage construction xmlns:xlink="http://www.w3.org/1999/xlink">parallel , to xmlns:xlink="http://www.w3.org/1999/xlink">generalized xmlns:xlink="http://www.w3.org/1999/xlink">multiblock generalized which turn yield many improved lower bounds cardinalities CDCs; quantity not known general.
منابع مشابه
Isotropic Constant Dimension Subspace Codes
In network code setting, a constant dimension code is a set of k-dimensional subspaces of F nq . If F_q n is a nondegenerated symlectic vector space with bilinear form f, an isotropic subspace U of F n q is a subspace that for all x, y ∈ U, f(x, y) = 0. We introduce isotropic subspace codes simply as a set of isotropic subspaces and show how the isotropic property use in decoding process, then...
متن کاملIsometry and automorphisms of constant dimension codes
We define linear and semilinear isometry for general subspace codes, used for random network coding. Furthermore, some results on isometry classes and automorphism groups of known constant dimension code constructions are derived.
متن کاملConstant dimension codes from Riemann-Roch spaces
Some families of constant dimension codes arising from Riemann-Roch spaces associated to particular divisors of a curve X are constructed. These families are generalizations of the one constructed by Hansen [7].
متن کاملLarge constant dimension codes and lexicodes
Constant dimension codes, with a prescribed minimum distance, have found recently an application in network coding. All the codewords in such a code are subspaces of Fq with a given dimension. A computer search for large constant dimension codes is usually inefficient since the search space domain is extremely large. Even so, we found that some constant dimension lexicodes are larger than other...
متن کاملConstructions of cyclic constant dimension codes
Subspace codes and particularly constant dimension codes have attracted much attention in recent years due to their applications in random network coding. As a particular subclass of subspace codes, cyclic subspace codes have additional properties that can be applied efficiently in encoding and decoding algorithms. It is desirable to find cyclic constant dimension codes such that both the code ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Information Theory
سال: 2021
ISSN: ['0018-9448', '1557-9654']
DOI: https://doi.org/10.1109/tit.2020.3038272